Precise interprocedural dataflow analysis with applications to constant propagation
نویسندگان
چکیده
منابع مشابه
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation
This paper concerns inter-procedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment (i.e., a mapping from symbols to values), and the effect of a program operation is represented by a distributive environment transformer. We present two efficient algorithms that produce precise solutions: an exhaustive algorithm that finds values...
متن کاملPrecise Interprocedural Dataaow Analysis with Applications to Constant Propagation 1
This paper concerns interprocedural dataaow-analysis problems in which the dataaow information at a program point is represented by an environment (i.e., a mapping from symbols to values), and the eeect of a program operation is represented by a distributive environment transformer. We present an eecient dynamic-programming algorithm that produces precise solutions. The method is applied to sol...
متن کاملPrecise Interprocedural Dataflow Analysis via Graph Reachability ( Extended
This paper shows how to find precise solutions to a large class of interprocedural dataflow-analysis problems in polynomial time. In contrast with intraprocedural dataflow analysis, where “precise” means “meet-over-all-paths”[16], a precise interprocedural dataflow-analysis algorithm must provide the “meet-over-all-valid-paths” solution. (A path is valid if it respects the fact that when a proc...
متن کاملIbm Research Report Combining Interprocedural Pointer Analysis and Conditional Constant Propagation Combining Interprocedural Pointer Analysis and Conditional Constant Propagation ?
LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and spe...
متن کامل- 1 - Demand Interprocedural Dataflow Analysis
An exhaustive dataflow analysis algorithm associates with each point in a program a set of “dataflow facts” that are guaranteed to hold whenever that point is reached during program execution. By contrast, a demand dataflow analysis algorithm determines whether a single given dataflow fact holds at a single given point. This paper presents a new demand algorithm for interprocedural dataflow ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00072-2